Near optimal single-track Gray codes
نویسندگان
چکیده
Single-track Gray codes are a special class of Gray codes which have advantages over conventional Gray codes in certain quantization and coding applications. The problem of constructing high period single-track Gray codes is considered. Three iterative constructions are given, along with a heuristic method for obtaining good seed-codes. In combination, these yield many families of very high period single-track Gray codes. In particular, for m > 3 , length ‘r~ = 2”, period 2” 2n codes are obtained.
منابع مشابه
The structure of single-track Gray codes
Single-track Gray codes are cyclic Gray codes with codewords of length n, such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the first track. We investigate the structure of such binary codes and show that there is no such code with 2n codewords when n is a power of 2. This implies that the known codes with 2n 2n codewords, when n is ...
متن کاملSingle-track circuit codes
Single-track circuit codes are circuit codes with codewords of length n such that all the n tracks which correspond to the n distinct coordinates of the codewords are cyclic shifts of the rst track. These codes simul taneously generalise single-track Gray codes and ordinary circuit codes. They are useful in angular quantisation applications in which error detecting and/or correcting capabilitie...
متن کاملFinding Single Track Gray Codes with SAT
Binary Codes are used in channel encodings, but also for encoding positions that can be decoded by sensors. These binary codes can be constructed, however, a code can also be found by searching a solution for a given specification. The paper presents how to specify codes for gray codes and single track gray codes, similar to [1].
متن کاملTight Bounds on the Minimum Euclidean Distance for Block Coded Phase Shift Keying
We present upper and lower bounds on the minimum Euclidean distance dEmin(C) for block coded PSK. The upper bound is an analytic expression depending on the alphabet size q, the block length n and the number of codewords jCj of the code C. This bound is valid for all block codes with q 4 and with medium or high rate codes where jCj > (q=3). The lower bound is valid for Gray coded binary codes o...
متن کاملGray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 1996